package problemLCR166;
//LCR166.珠宝的最高价值
//https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/

class Solution {
    public int jewelleryValue(int[][] frame) {
        int n = frame.length;
        int m = frame[0].length;
        int dp[][] = new int[n+1][m+1];
        for(int i = 1; i<=n; i++) {
            for(int j = 1; j<=m; j++) {
                dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]) + frame[i-1][j-1];
            }
        }
        return dp[n][m];
    }
}